Spatial reasoning with RCC8 and connectedness constraints in Euclidean spaces

نویسندگان

  • Roman Kontchakov
  • Ian Pratt-Hartmann
  • Michael Zakharyaschev
چکیده

The language RCC8 is a widely-studied formalism for describing topological arrangements of spatial regions. The variables of this language range over the collection of non-empty, regular closed sets of n-dimensional Euclidean space, here denoted RC(Rn), and its non-logical primitives allow us to specify how the interiors, exteriors and boundaries of these sets intersect. The key question is the satisfiability problem: given a finite set of atomic RCC8constraints in m variables, determine whether there exists an m-tuple of elements of RC(Rn) satisfying them. These problems are known to coincide for all n ≥ 1, so that RCC8-satisfiability is independent of dimension. This common satisfiability problem is NLogSpace-complete. Unfortunately, RCC8 lacks the means to say that a spatial region comprises a ‘single piece’, and the present article investigates what happens when this facility is added. We consider two extensions of RCC8: RCC8c, in which we can state that a region is connected, and RCC8c◦, in which we can instead state that a region has a connected interior. The satisfiability problems for both these languages are easily seen to depend on the dimension n, for n ≤ 3. Furthermore, in the case of RCC8c◦, we show that there exist finite sets of constraints that are satisfiable over RC(R2), but only by ‘wild’ regions having no possible physical meaning. This prompts us to consider interpretations over the more restrictive domain of non-empty, regular closed, polyhedral sets, RCP(Rn). We show that (a) the satisfiability problems for RCC8c (equivalently, RCC8c◦) over RC(R) and RCP(R) are distinct and both NP-complete; (b) the satisfiability problems for RCC8c over RC(R2) and RCP(R2) are identical and NP-complete; (c) the satisfiability problems for RCC8c◦ over RC(R2) and RCP(R2) are distinct, and the latter is NP-complete. Decidability of the satisfiability problem for RCC8c◦ over RC(R2) is open. For n ≥ 3, RCC8c and RCC8c◦ are not interestingly different from RCC8. We finish by answering the following question: given that a set of RCC8cor RCC8c◦-constraints is satisfiable over RC(Rn) or RCP(Rn), how complex is the simplest satisfying assignment? In particular, we exhibit, for both languages, a sequence of constraints Φn, satisfiable over RCP(R2), such that the size of Φn grows polynomially in n, while the smallest configuration of polygons satisfying Φn cuts the plane into a number of pieces that grows exponentially. We further show that, over RC(R2), RCC8c again requires exponentially large satisfying diagrams, while RCC8c◦ can force regions in satisfying configurations to have infinitely many components.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reasoning about Topological and Cardinal Direction Relations Between 2-Dimensional Spatial Objects

Increasing the expressiveness of qualitative spatial calculi is an essential step towards meeting the requirements of applications. This can be achieved by combining existing calculi in a way that we can express spatial information using relations from multiple calculi. The great challenge is to develop reasoning algorithms that are correct and complete when reasoning over the combined informat...

متن کامل

On the Translation of Qualitative Spatial Reasoning Problems into Modal Logics

Among the formalisms for qualitative spatial reasoning, the Region Connection Calculus and its variant, the constraint algebra RCC8, have received particular attention recently. A translation of RCC8 constraints into a multimodal logic has been proposed by Bennett, but in his work a thorough semantical foundation of RCC8 and of the translation into modal logic is missing. In the present paper, ...

متن کامل

Realizing RCC8 networks using convex regions

RCC8 is a popular fragment of the region connection calculus, in which qualitative spatial relations between regions, such as adjacency, overlap and parthood, can be expressed. While RCC8 is essentially dimensionless, most current applications are confined to reasoning about two-dimensional or threedimensional physical space. In this paper, however, we are mainly interested in conceptual spaces...

متن کامل

On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces

We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates, as well as Boolean operations on regions, interpreted over low-dimensional Euclidean spaces. We show that the complexity of reasoning varies dramatically depending on the dimension of the space and on the type of regions considered. For example, the logic with the interior-connecte...

متن کامل

Reasoning with Topological and Directional Spatial Information

Current research on qualitative spatial representation and reasoning mainly focuses on one single aspect of space. In real world applications, however, multiple spatial aspects are often involved simultaneously. This paper investigates problems arising in reasoning with combined topological and directional information. We use the RCC8 algebra and the Rectangle Algebra (RA) for expressing topolo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Artif. Intell.

دوره 217  شماره 

صفحات  -

تاریخ انتشار 2014